A New Shuffled Frog Leaping Algorithm with Space Zoomed Factor and Gravity Attractor
نویسندگان
چکیده
Shuffled frog leaping algorithm is a new kind of swarm intelligence optimization algorithm. Due to the local search of the basic shuffled frog leaping algorithm which is the only by the worst frog to search and jump, searching ability of which was limited; therefore it had the low precision, slow convergence speed and easy premature convergence etc. Therefore, in order to enhance the ability of the local searching, this paper presented a gravity attractor, all the frogs in the same memeplexe could find the best position under its guidance. Considering the transboundary problems in the frog searching for food process, we introduced a space zoomed factor which made the frog out of the searching space could also be put into the searching space, and the social position relation was not changed, thus it improve the search ability of the SFLA. Through the standard function for testing, and compared with the standard SFLA algorithm and szAPSO algorithm, the experimental results show that the improved algorithm not only improves the convergence speed of the algorithm, enhance the searching capability of the algorithm, but also has better stability.
منابع مشابه
Shuffled Frog-Leaping Programming for Solving Regression Problems
There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...
متن کاملCombined Heat and Power Economic Dispatch using Improved Shuffled Frog Leaping Algorithm
Recently, Combined Heat and Power (CHP) systems have been utilized increasingly in power systems. With the addition penetration of CHP-based co-generation of electricity and heat, the determination of economic dispatch of power and heat becomes a more complex and challenging issue. The optimal operation of CHP-based systems is inherently a nonlinear and non-convex optimization problem with a lo...
متن کاملUsing the Modified Shuffled Frog Leaping Algorithm for Optimal Sizing and location of Distributed Generation Resources for Reliability Improvement
Restructuring the recent developments in the power system and problems arising from construction as well as the maintenance of large power plants lead to increase in using the Distributed Generation (DG) resources. DG units due to its specifications, technology and location network connectivity can improve system and load point reliability indices. In this paper, the allocation and sizing of di...
متن کاملVoltage Flicker Parameters Estimation Using Shuffled Frog Leaping Algorithm and Imperialistic Competitive Algorithm
Measurement of magnitude and frequency of the voltage flicker is very important for monitoring andcontrolling voltage flicker efficiently to improve the network power quality. This paper presents twonew methods for measurement of flicker signal parameters using Shuffled Frog Leaping Algorithm(SFLA) and Imperialist Competitive Algorithm (ICA). This paper estimates fundamental voltage andflicker ...
متن کاملGenetic and Improved Shuffled Frog Leaping Algorithms for a 2-Stage Model of a Hub Covering Location Network
Hub covering location problem, Network design, Single machine scheduling, Genetic algorithm, Shuffled frog leaping algorithm Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JDIM
دوره 11 شماره
صفحات -
تاریخ انتشار 2013